Abstract Domains for Reordering CLP(RLin) Programs
نویسندگان
چکیده
domains for reordering CLP(RLin) programs V. Ramachandran, P. Van Hentenryck, A. Cortesi* a Brown University, Computer Science Department, Box 1910, Providence, RI 02912, USA b Universite Catholique de Louvain, 2 Place Sainte-Barbe, B-1348 Louvain-la-Neuve, Belgium c Universit a Ca' Foscari, Dipartimento di Informatica, via Torino 155, 1-30170 Venezia, Italy Received 8 November 1997; received in revised form 1 October 1998; accepted 8 January 1999
منابع مشابه
Optimizations of CLP ( < Lin )
This paper describes the design and implementation of an optimizing compiler for CLP(< Lin), a constraint logic programming language over linear real constraints. The compiler performs a number of source to source optimizations which aim at replacing constraint solving, the basic operation of the language, by assignments (when, at runtime, all but one variables have a xed value) and tests (when...
متن کاملStatic Analysis of CLP Programs over Numeric Domains
Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP has in addition an algebraic semantics. CLP is then a general paradigm which may be instantiated on...
متن کاملAn Extension of the WAM for
We present in this paper the implementation of DecLIC, a new CLP language achieving the cooperation of two diierent local consistencies, viz. hull-consistency 1] and box-consistency 3]. DecLIC is based on clp(fd) 8], a solver over Finite Domains compiling CLP programs into C via the Warren Abstract Machine (WAM) 15]. The extension of the WAM instruction set necessary to support DecLIC new featu...
متن کاملEffectiveness of Optimizing Compilation for CLP(R)
Constraint Logic Programming (CLP) languages extend logic programming by allowing constraints from diierent domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive mathematical modelling and complex combinatorial optimization problems. However, CLP languages have mainly been considered as research systems, useful for rapid...
متن کاملStatic Analysis of CLP Programs overNumeric
Extended Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, xpoint and operational semantics 9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP has in addition an algebraic semantics. CLP is then a general paradigm which may be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Program.
دوره 42 شماره
صفحات -
تاریخ انتشار 2000